Model Checking Vector Addition Systems with one zero-test
نویسندگان
چکیده
منابع مشابه
Model Checking Vector Addition Systems with one zero-test
We design a variation of the Karp-Miller algorithm to compute, in a forward manner, a finite representation of the cover (i.e., the downward closure of the reachability set) of a vector addition system with one zero-test. This algorithm yields decision procedures for several problems for these systems, open until now, such as place-boundedness or LTL model-checking. The proof techniques to hand...
متن کاملPlace-Boundedness for Vector Addition Systems with one zero-test
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a variation of the Karp-Miller algorithm to compute a basis of the downward closure of the reachability set which allows to decide place-boundedness. This forward algorithm is able to pass the zero-tests thanks to a finer ...
متن کاملModel Checking Lossy Vector Addition Systems
Lossy VASS (vector addition systems with states) are deened as a subclass of VASS in analogy to lossy FIFO-channel systems. They can be used to model concurrent systems with unreliable communication. We analyze the decidability of model checking problems for lossy systems and several branching-time and linear-time temporal logics. We present an almost complete picture of the decidability of mod...
متن کاملModel Checking Coverability Graphs of Vector Addition Systems
A large number of properties of a vector addition system—for instance coverability, boundedness, or regularity—can be decided using its coverability graph, by looking for some characteristic pattern. We propose to unify the known exponential-space upper bounds on the complexity of such problems on vector addition systems, by seeing them as instances of the model-checking problem for a suitable ...
متن کاملThe reachability problem for Vector Addition System with one zero-test by Leroux method
We consider here a variation of Vector Addition Systems where one counter can be tested for zero, extending the reachability proof by Leroux for Vector Addition System to our model. This provides an alternate, and hopefully simpler to understand, proof of the reachability problem that was originally proved by Reinhardt.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2012
ISSN: 1860-5974
DOI: 10.2168/lmcs-8(2:11)2012